A Parallel Shuffled Complex Evolution Model Calibrating Algorithm to Reduce Computational Time
نویسندگان
چکیده
The Shuffled Complex Evolution (SCE-UA) method has been widely applied for calibration of rainfall-runoff models and has been shown to be robust and efficient search algorithm. In spite of its superiority, since many commonly used rainfallrunoff models have large simulation times, the use of model calibrating algorithms may become impractical due to the high computational time involved. This would necessitate the use of superior parallel computing technologies in the calibrating algorithms, with the aim of reducing the computational times. This study aims to parallelize the SCE-UA to accelerate the model calibrating process.
منابع مشابه
Optimum Parameters for Tuned Mass Damper Using Shuffled Complex Evolution (SCE) Algorithm
This study is investigated the optimum parameters for a tuned mass damper (TMD) under the seismic excitation. Shuffled complex evolution (SCE) is a meta-heuristic optimization method which is used to find the optimum damping and tuning frequency ratio for a TMD. The efficiency of the TMD is evaluated by decreasing the structural displacement dynamic magnification factor (DDMF) and acceleration ...
متن کاملA New ILP Model for Identical Parallel-Machine Scheduling with Family Setup Times Minimizing the Total Weighted Flow Time by a Genetic Algorithm
This paper presents a novel, integer-linear programming (ILP) model for an identical parallel-machine scheduling problem with family setup times that minimizes the total weighted flow time (TWFT). Some researchers have addressed parallel-machine scheduling problems in the literature over the last three decades. However, the existing studies have been limited to the research of independent jobs,...
متن کاملShuffled Complex Evolution Model Calibrating Algorithm: Enhancing its Robustness and Efficiency
The Shuffled Complex Evolution (SCE-UA) has been used extensively and proved to be a robust and efficient global optimization method for the calibration of conceptual models. In this paper, we propose two enhancements to the SCE-UA algorithm, one to improve its exploration and another to improve its exploitation capability of the search space. A strategically located initial population is used ...
متن کاملA new multi-mode and multi-product hub covering problem: A priority M/M/c queue approach
One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...
متن کاملCAPACITATED VEHICLE ROUTING PROBLEM WITH VEHICLES HIRE OR PURCHASE DECISION: MODELING AND SOLUTION APPROACHES
The overall cost of companies dealing with the distribution tasks is considerably affected by the way that distributing vehicles are procured. In this paper, a more practical version of capacitated vehicle routing problem (CVRP) in which the decision of purchase or hire of vehicles is simultaneously considered is investigated. In CVRP model capacitated vehicles start from a single depot simulta...
متن کامل